Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategies for Handling Temporal Uncertainty in Pickup and Delivery Problems with Time Windows

In many real-life routing problems there is more uncertainty with respect to the required timing of the service than with respect to the service locations. We focus on a pickup and delivery problem with time windows in which the pickup and drop-o↵ locations of the service requests are fully known in advance, but the time at which these jobs will require service is only fully revealed during ope...

متن کامل

A decomposition approach for commodity pickup and delivery with time-windows under uncertainty

We consider a special class of large-scale, network-based, resource allocation problems under uncertainty, namely that of multi-commodity flows with time-windows under uncertainty. In this class, we focus on problems involving commodity pickup and delivery with time windows. Our work examines methods of proactive planning, that is, robust plan generation to protect against future uncertainty. B...

متن کامل

A decomposition approach for commodity pickup and delivery with time-windows under uncertainty Citation

We consider a special class of large-scale, network-based, resource allocation problems under uncertainty, namely that of multi-commodity flows with time-windows under uncertainty. In this class, we focus on problems involving commodity pickup and delivery with time windows. Our work examines methods of proactive planning, that is, robust plan generation to protect against future uncertainty. B...

متن کامل

Models and branch-and-cut algorithms for pickup and delivery problems with time windows

In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precedence constraints on pickups and deliveries. This paper introduces two new formulations for the PDPTW and the cl...

متن کامل

A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows

This paper presents a two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows and multiple vehicles (PDPTW). The first stage uses a simple simulated annealing algorithm to decrease the number of routes, while the second stage uses LNS to decrease total travel cost. Experimental results show the effectiveness of the algorithm which has produced many new best...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transportation Science

سال: 2018

ISSN: 0041-1655,1526-5447

DOI: 10.1287/trsc.2015.0658